A Quorum Based k-Mutual Exclusion by Weighted k-Quorum Systems
نویسنده
چکیده
In this paper, we propose a scheme for solving the k-mutual exclusion problem in a distributed system, which is a generalization of the quorum based scheme for solving the distributed mutual exclusion problem. The proposed scheme uses a set of weighted quorums as the underlying structure, which can be constructed from any quorum system by applying the technique of k-decomposition. The notion of balanced k-decomposition and a realization of weighted k-quorum systems without k-decomposition are also given. 1998 Elsevier Science B.V. All rights reserved.
منابع مشابه
Nondominated k-Coteries for Multiple Mutual Exclusion
Quorum-based mutual exclusion algorithms are resilient to node and communication line failures. In order to enter its critical section, a node must obtain permission from a quorum of nodes. A collection of quorums is called a coterie. The most resilient coteries are called nondominated coteries. Recently, k-coteries were proposed to be used in mutual exclusion algorithms that allow up to k entr...
متن کاملA Quorum Based (m, h, k)-Resource Allocation Algorithm
In this paper, we present a quorum based algorithm for (m,h, k)-resource allocation problem, i.e., a conflict resolution problem to control a distributed system consisting of n users and m critical resources so that the following two requirements are satisfied: at any given time, at most h (out of m) resources can be utilized by some users simultaneously and each resource is utilized by at most...
متن کاملA Delay-Optimal Quorum-Based Mutual Exclusion Algorithm for Distributed Systems
ÐThe performance of a mutual exclusion algorithm is measured by the number of messages exchanged per critical section execution and the delay between successive executions of the critical section. There is a message complexity and synchronization delay trade-off in mutual exclusion algorithms. The Lamport algorithm and the Ricart-Agrawal algorithm both have a synchronization delay of T (T is th...
متن کاملA generalized grid quorum strategy for k-mutual exclusion in distributed systems
In the problem of k-mutual exclusion, concurrent access to shared resource or the critical section (CS) must be synchronized such that at any time at most k processes can access the CS. In this paper, we propose a generalized grid quorum strategy for k-mutual exclusion, which imposes a logical grid structure on the network. The quorum size is always equal to (M + 1)/(k + 1) × (N + 1)/2 , where ...
متن کاملA Delay-Optimal Quorum-Based Mutual Exclusion Scheme with Fault-Tolerance Capability
The performance of a mutual exclusion algorithm is measured by the number of messages exchanged per critical section execution and the delay between successive executions of the critical section. There is a message complexity and synchronization delay trade-oo in mutual exclusion algorithms. Lamport's algorithm and Ricart-Agrawal algorithm both have a synchronization delay of T, but their messa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 67 شماره
صفحات -
تاریخ انتشار 1998